Sciweavers

419 search results - page 29 / 84
» Constraint models for graceful graphs
Sort
View
ICML
2010
IEEE
13 years 12 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
RECOMB
2004
Springer
14 years 11 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...
VLSID
2002
IEEE
151views VLSI» more  VLSID 2002»
14 years 11 months ago
Mode Selection and Mode-Dependency Modeling for Power-Aware Embedded Systems
Among the many techniques for system-level power management, it is not currently possible to guarantee timing constraints and have a comprehensive system model at the same time. S...
Dexin Li, Pai H. Chou, Nader Bagherzadeh
VLC
2008
132views more  VLC 2008»
13 years 10 months ago
Enforced generative patterns for the specification of the syntax and semantics of visual languages
We present the new notion of enforced generative pattern, a structure that declares positive or negative conditions that must be satisfied by a model. Patterns are applied to tran...
Paolo Bottoni, Esther Guerra, Juan de Lara
DEXAW
2005
IEEE
176views Database» more  DEXAW 2005»
14 years 26 days ago
Indexes and Path Constraints in Semistructured Data
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
Yves Andre, Anne-Cécile Caron, Denis Debarb...