Sciweavers

1422 search results - page 163 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
CISS
2008
IEEE
16 years 26 days ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
AGENTS
1998
Springer
15 years 10 months ago
WebACE: A Web Agent for Document Categorization and Exploration
We propose an agent for exploring and categorizing documents on the World Wide Web based on a user pro le. The heart of the agent is an automatic categorization of a set of docume...
Eui-Hong Han, Daniel Boley, Maria L. Gini, Robert ...
CVGIP
2004
125views more  CVGIP 2004»
15 years 6 months ago
Efficient representation and extraction of 2-manifold isosurfaces using kd-trees
In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in term...
Alexander Greß, Reinhard Klein
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 3 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
BMCBI
2010
136views more  BMCBI 2010»
15 years 6 months ago
Bias correction and Bayesian analysis of aggregate counts in SAGE libraries
Background: Tag-based techniques, such as SAGE, are commonly used to sample the mRNA pool of an organism's transcriptome. Incomplete digestion during the tag formation proces...
Russell L. Zaretzki, Michael A. Gilchrist, William...