Sciweavers

5473 search results - page 651 / 1095
» On the graph isomorphism problem
Sort
View
RECOMB
2004
Springer
16 years 7 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 4 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
16 years 3 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
DATE
2009
IEEE
131views Hardware» more  DATE 2009»
16 years 1 months ago
Communication minimization for in-network processing in body sensor networks: A buffer assignment technique
—Body sensor networks are emerging as a promising platform for healthcare monitoring. These systems are composed of battery-operated embedded devices which process physiological ...
Hassan Ghasemzadeh, Nisha Jain, Marco Sgroi, Roozb...
ACCV
2009
Springer
16 years 1 months ago
Transductive Segmentation of Textured Meshes
This paper addresses the problem of segmenting a textured mesh into objects or object classes, consistently with user-supplied seeds. We view this task as transductive learning and...
Anne-Laure Chauve, Jean-Philippe Pons, Jean-Yves A...