Sciweavers

62 search results - page 6 / 13
» Supporting ad-hoc ranking aggregates
Sort
View
AAAI
2008
13 years 9 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
ML
2010
ACM
141views Machine Learning» more  ML 2010»
13 years 5 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
SIGOPSE
2004
ACM
14 years 23 days ago
Generic role assignment for wireless sensor networks
Wireless ad hoc networks of sensor nodes are envisioned to be deployed in the physical environment to monitor a wide variety of real-world phenomena. Almost any sensor network appl...
Kay Römer, Christian Frank, Pedro José...
ICC
2011
IEEE
257views Communications» more  ICC 2011»
12 years 7 months ago
Increasing the Lifetime of Roadside Sensor Networks Using Edge-Betweenness Clustering
Abstract—Wireless Sensor Networks are proven highly successful in many areas, including military and security monitoring. In this paper, we propose a method to use the edge–bet...
Joakim Flathagen, Ovidiu Valentin Drugan, Paal E. ...
CHI
2008
ACM
13 years 9 months ago
Using information scent to model the dynamic foraging behavior of programmers in maintenance tasks
In recent years, the software engineering community has begun to study program navigation and tools to support it. Some of these navigation tools are very useful, but they lack a ...
Joseph Lawrance, Rachel K. E. Bellamy, Margaret M....