Sciweavers

10608 search results - page 1661 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
DMSN
2007
ACM
15 years 9 months ago
SenseSwarm: a perimeter-based data acquisition framework for mobile sensor networks
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
Demetrios Zeinalipour-Yazti, Panayiotis Andreou, P...
BIBE
2004
IEEE
160views Bioinformatics» more  BIBE 2004»
15 years 9 months ago
A Time Series Analysis of Microarray Data
As the capture and analysis of single-time-point microarray expression data becomes routine, investigators are turning to time-series expression data to investigate complex gene r...
Selnur Erdal, Ozgur Ozturk, David L. Armbruster, H...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
15 years 8 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
CEAS
2006
Springer
15 years 8 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 8 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
« Prev « First page 1661 / 2122 Last » Next »