Sciweavers

1133 search results - page 196 / 227
» Basics of Graph Cuts
Sort
View
PAMI
2008
197views more  PAMI 2008»
13 years 8 months ago
LEGClust - A Clustering Algorithm Based on Layered Entropic Subgraphs
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
Jorge M. Santos, Joaquim Marques de Sá, Lu&...
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 6 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
14 years 5 months ago
Algorithms for simultaneous consideration of multiple physical synthesis transforms for timing closure
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...
Huan Ren, Shantanu Dutt
CC
2007
Springer
129views System Software» more  CC 2007»
14 years 3 months ago
Extended Linear Scan: An Alternate Foundation for Global Register Allocation
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
Vivek Sarkar, Rajkishore Barik
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 10 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...