Sciweavers

14161 search results - page 2534 / 2833
» On generalized middle-level problem
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
CBSE
2011
Springer
14 years 6 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
CIKM
2011
Springer
14 years 6 months ago
Content based social behavior prediction: a multi-task learning approach
The study of information flow analyzes the principles and mechanisms of social information distribution. It is becoming an extremely important research topic in social network re...
Hongliang Fei, Ruoyi Jiang, Yuhao Yang, Bo Luo, Ju...
CIKM
2011
Springer
14 years 6 months ago
Tractable XML data exchange via relations
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...
Rada Chirkova, Leonid Libkin, Juan L. Reutter
CIKM
2011
Springer
14 years 6 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
« Prev « First page 2534 / 2833 Last » Next »