Sciweavers

429 search results - page 73 / 86
» cluster 2002
Sort
View
83
Voted
ICPR
2002
IEEE
15 years 11 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
68
Voted
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
15 years 10 months ago
Scalable and near real-time burst detection from eCommerce queries
In large scale online systems like Search, eCommerce, or social network applications, user queries represent an important dimension of activities that can be used to study the imp...
Nish Parikh, Neel Sundaresan
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
15 years 10 months ago
A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...
Evangeline F. Y. Young, Chris C. N. Chu, M. L. Ho
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
15 years 10 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
OSDI
2002
ACM
15 years 10 months ago
Integrated Resource Management for Cluster-based Internet Services
Client request rates for Internet services tend to be bursty and thus it is important to maintain efficient resource utilization under a wide range of load conditions. Network ser...
Kai Shen, Hong Tang, Tao Yang, Lingkun Chu