4555 search results - page 618 / 911 » Deductive Algorithmic Knowledge |
286
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
182
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
193
Voted
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
184
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
196
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...