Sciweavers

949 search results - page 83 / 190
» exact 2008
Sort
View
103
Voted
CIKM
2008
Springer
15 years 2 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 2 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
114
Voted
FOCS
2008
IEEE
15 years 23 days ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
ICCD
2008
IEEE
133views Hardware» more  ICCD 2008»
15 years 9 months ago
Reliability-aware Dynamic Voltage Scaling for energy-constrained real-time embedded systems
— The Dynamic Voltage Scaling (DVS) technique is the basis of numerous state-of-the-art energy management schemes proposed for real-time embedded systems. However, recent researc...
Baoxian Zhao, Hakan Aydin, Dakai Zhu
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
15 years 2 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...