Sciweavers

8768 search results - page 1747 / 1754
» Generalizing the notion of support
Sort
View
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
13 years 11 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
CBSE
2011
Springer
13 years 11 months ago
Rectifying orphan components using group-failover in distributed real-time and embedded systems
Orphan requests are a significant problem for multi-tier distributed systems since they adversely impact system correctness by violating the exactly-once semantics of application...
Sumant Tambe, Aniruddha S. Gokhale
98
Voted
CBSE
2011
Springer
13 years 11 months ago
Towards incremental component compatibility testing
Software components are increasingly assembled from other components. Each component may further depend on others, and each may have multiple active versions. The total number of ...
Il-Chul Yoon, Alan Sussman, Atif M. Memon, Adam A....
CIKM
2011
Springer
13 years 11 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
105
Voted
CIKM
2011
Springer
13 years 11 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
« Prev « First page 1747 / 1754 Last » Next »