Sciweavers

202 search results - page 35 / 41
» Performance-Driven Partitioning Using a Replication Graph Ap...
Sort
View
BSN
2009
IEEE
106views Sensor Networks» more  BSN 2009»
14 years 17 days ago
Transitional Activity Recognition with Manifold Embedding
— Activity monitoring is an important part of pervasive sensing, particularly for assessing activities of daily living for elderly patients and those with chronic diseases. Previ...
Raza Ali, Louis Atallah, Benny P. L. Lo, Guang-Zho...
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ENTCS
2002
89views more  ENTCS 2002»
13 years 7 months ago
ZEUS: A Distributed Timed Model-Checker Based on KRONOS
In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTLreachability properties ...
Víctor A. Braberman, Alfredo Olivero, Ferna...
BMCBI
2010
144views more  BMCBI 2010»
13 years 7 months ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...
CVPR
2010
IEEE
14 years 3 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun