Sciweavers

728 search results - page 85 / 146
» ideas 2009
Sort
View
WADS
2009
Springer
245views Algorithms» more  WADS 2009»
14 years 3 months ago
Online Square Packing
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Sándor P. Fekete, Tom Kamphans, Nils Schwee...
WAIM
2009
Springer
14 years 3 months ago
SLICE: A Novel Method to Find Local Linear Correlations by Constructing Hyperplanes
Finding linear correlations in dataset is an important data mining task, which can be widely applied in the real world. Existing correlation clustering methods combine clustering w...
Liang Tang, Changjie Tang, Lei Duan, Yexi Jiang, J...
WDAG
2009
Springer
103views Algorithms» more  WDAG 2009»
14 years 3 months ago
Distributed Discovery of Large Near-Cliques
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
Zvika Brakerski, Boaz Patt-Shamir
WEBI
2009
Springer
14 years 3 months ago
Rigorous Probabilistic Trust-Inference with Applications to Clustering
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
Thomas DuBois, Jennifer Golbeck, Aravind Srinivasa...
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
14 years 3 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...