Sciweavers

105 search results - page 19 / 21
» Algorithmic Proof with Diminishing Resources, Part 1
Sort
View
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 1 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
VLDB
2001
ACM
82views Database» more  VLDB 2001»
14 years 5 days ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
HPDC
2008
IEEE
14 years 2 months ago
Ontological framework for a free-form query based grid search engine
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...
Chaitali Gupta, Rajdeep Bhowmik, Madhusudhan Govin...
PPOPP
2006
ACM
14 years 1 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller
ML
2008
ACM
13 years 7 months ago
Incremental exemplar learning schemes for classification on embedded devices
Although memory-based classifiers offer robust classification performance, their widespread usage on embedded devices is hindered due to the device's limited memory resources...
Ankur Jain, Daniel Nikovski