Sciweavers

7978 search results - page 792 / 1596
» Combining shared-coin algorithms
Sort
View
INFOCOM
2005
IEEE
16 years 1 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
KBSE
2005
IEEE
16 years 1 months ago
On dynamic feature location
Feature location aims at locating pieces of code that implement a given set of features (requirements). It is a necessary first step in every program comprehension and maintenanc...
Rainer Koschke, Jochen Quante
SENSYS
2005
ACM
16 years 1 months ago
CenWits: a sensor-based loosely coupled search and rescue system using witnesses
This paper describes the design, implementation and evaluation of a search and rescue system called CenWits. CenWits uses several small, commonly-available RF-based sensors, and a...
Jyh-How Huang, Saqib Amjad, Shivakant Mishra
SIGIR
2005
ACM
16 years 1 months ago
Using term informativeness for named entity detection
Informal communication (e-mail, bulletin boards) poses a difficult learning environment because traditional grammatical and lexical information are noisy. Other information is nec...
Jason D. M. Rennie, Tommi Jaakkola
CBSE
2005
Springer
16 years 1 months ago
Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components
Abstract. Searching and subsequently selecting reusable components from component repositories has become a key impediment for not only component-based development but also for ach...
Naiyana Tansalarak, Kajal T. Claypool