Sciweavers

4037 search results - page 57 / 808
» Routing without ordering
Sort
View
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
14 years 8 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
ISBRA
2010
Springer
14 years 3 months ago
Modeling without Borders: Creating and Annotating VCell Models Using the Web
Biological research is becoming increasingly complex and data-rich, with multiple public databases providing a variety of resources: hundreds of thousands of substances and interac...
Michael L. Blinov, Oliver Ruebenacker, James C. Sc...
MICRO
2009
IEEE
129views Hardware» more  MICRO 2009»
14 years 3 months ago
In-network coherence filtering: snoopy coherence without broadcasts
With transistor miniaturization leading to an abundance of on-chip resources and uniprocessor designs providing diminishing returns, the industry has moved beyond single-core micr...
Niket Agarwal, Li-Shiuan Peh, Niraj K. Jha
P2P
2006
IEEE
121views Communications» more  P2P 2006»
14 years 3 months ago
The Orchard Algorithm: P2P Multicasting without Free-Riding
The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g.,...
Jan-David Mol, Dick H. J. Epema, Henk J. Sips
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
14 years 1 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin