Sciweavers

4009 search results - page 238 / 802
» Clustering on Complex Graphs
Sort
View
FM
2009
Springer
95views Formal Methods» more  FM 2009»
15 years 10 months ago
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
15 years 9 months ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...
JSC
2007
84views more  JSC 2007»
15 years 5 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
ICMCS
2007
IEEE
124views Multimedia» more  ICMCS 2007»
15 years 11 months ago
Robust Video Object Segmentation Based on K-Means Background Clustering and Watershed in Ill-Conditioned Surveillance Systems
A robust video object segmentation algorithm for complex conditions in surveillance systems is proposed in this paper. This algorithm contains an unsupervised K-Means background c...
Tse-Wei Chen, Shou-Chieh Hsu, Shao-Yi Chien
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 5 months ago
Materialized View Selection by Query Clustering in XML Data Warehouses
XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native XML database management systems currently bear limited p...
Hadj Mahboubi, Kamel Aouiche, Jérôme ...