Sciweavers

17983 search results - page 3320 / 3597
» Set Types and Applications
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 5 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
16 years 5 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
16 years 5 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
16 years 5 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 5 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
« Prev « First page 3320 / 3597 Last » Next »