Sciweavers

2761 search results - page 325 / 553
» Collaborative model merging
Sort
View
142
Voted
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
104
Voted
SEMWEB
2007
Springer
15 years 10 months ago
Potluck: Data Mash-Up Tool for Casual Users
As more and more reusable structured data appears on the Web, casual users will want to take into their own hands the task of mashing up data rather than wait for mash-up sites to ...
David F. Huynh, Robert C. Miller, David R. Karger
ADBIS
2006
Springer
103views Database» more  ADBIS 2006»
15 years 10 months ago
Bridging the Gap between Comparison and Conforming the Views in View Integration
View integration is a complex, error-prone and time-consuming task. Therefore there is a need to decompose the integration methods into smaller well defined phases where different ...
Peter Bellström
144
Voted
SIGIR
2006
ACM
15 years 10 months ago
Probabilistic latent query analysis for combining multiple retrieval sources
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
Rong Yan, Alexander G. Hauptmann
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
15 years 10 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman