Sciweavers

1933 search results - page 200 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 4 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
CCCG
2006
15 years 5 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison
ALGOSENSORS
2008
Springer
15 years 6 months ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...
SEMCO
2008
IEEE
15 years 10 months ago
Sentiment Regression: Using Real-Valued Scores to Summarize Overall Document Sentiment
In this paper, we consider a sentiment regression problem: summarizing the overall sentiment of a review with a real-valued score. Empirical results on a set of labeled reviews sh...
Adam Drake, Eric K. Ringger, Dan Ventura
RTSS
2000
IEEE
15 years 8 months ago
Performance Specifications and Metrics for Adaptive Real-Time Systems
While early research on real-time computing was concerned with guaranteeing avoidance of undesirable effects such as overload and deadline misses, adaptive real-time systems are d...
Chenyang Lu, John A. Stankovic, Tarek F. Abdelzahe...