Sciweavers

1933 search results - page 192 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
ECCC
2010
143views more  ECCC 2010»
15 years 1 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 5 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
15 years 9 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
IIR
2010
15 years 5 months ago
Context-Dependent Recommendations with Items Splitting
Recommender systems are intelligent applications that help on-line users to tackle information overload by providing recommendations of relevant items. Collaborative Filtering (CF...
Linas Baltrunas, Francesco Ricci
ECML
2004
Springer
15 years 8 months ago
Multi-level Boundary Classification for Information Extraction
Abstract. We investigate the application of classification techniques to the problem of information extraction (IE). In particular we use support vector machines and several differ...
Aidan Finn, Nicholas Kushmerick