Sciweavers

3190 search results - page 498 / 638
» cans 2011
Sort
View
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
14 years 6 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
ATAL
2011
Springer
14 years 6 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
CIKM
2011
Springer
14 years 6 months ago
Semi-supervised multi-task learning of structured prediction models for web information extraction
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
Paramveer S. Dhillon, Sundararajan Sellamanickam, ...
CIKM
2011
Springer
14 years 6 months ago
Integrating and querying web databases and documents
There exist many interrelated information sources on the Internet that can be categorized into structured (database) and semistructured (documents). A key challenge is to integrat...
Carlos Garcia-Alvarado, Carlos Ordonez
CLUSTER
2011
IEEE
14 years 6 months ago
Performance Characterization and Optimization of Atomic Operations on AMD GPUs
—Atomic operations are important building blocks in supporting general-purpose computing on graphics processing units (GPUs). For instance, they can be used to coordinate executi...
Marwa Elteir, Heshan Lin, Wu-chun Feng