Sciweavers

138 search results - page 16 / 28
» Clustering Cycles into Cycles of Clusters
Sort
View
IJCAI
2007
13 years 9 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
VIIP
2001
13 years 9 months ago
Parallel Detection of Closed Streamlines in Planar Flows
Closed streamlines are an integral part of vector field topology, since they behave like sources respectively sinks but are often neither considered nor detected. If a streamline ...
Thomas Wischgoll, Gerik Scheuermann, Hans Hagen
CVPR
2011
IEEE
13 years 4 months ago
Learning the Easy Things First: Self-Paced Visual Category Discovery
Objects vary in their visual complexity, yet existing discovery methods perform “batch” clustering, paying equal attention to all instances simultaneously—regardless of the ...
Yong Jae Lee, Kristen Grauman
ADAPTIVE
2007
Springer
14 years 2 months ago
Data Mining for Web Personalization
Abstract. In this chapter we present an overview of Web personalization process viewed as an application of data mining requiring support for all the phases of a typical data minin...
Bamshad Mobasher
ISPD
2003
ACM
132views Hardware» more  ISPD 2003»
14 years 1 months ago
Architecture and synthesis for multi-cycle communication
For multi-gigahertz designs in nanometer technologies, data transfers on global interconnects take multiple clock cycles. In this paper, we propose a regular distributed register ...
Jason Cong, Yiping Fan, Xun Yang, Zhiru Zhang