Sciweavers

10051 search results - page 41 / 2011
» A Dynamic Separator Algorithm
Sort
View
COMPGEOM
1997
ACM
15 years 4 months ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
Béla Bollobás, Gautam Das, Dimitrios...
91
Voted
DICTA
2003
15 years 1 months ago
Separating a Colour Texture from an Arbitrary Background
Partially supervised segmentation, that is, segmentation with always incomplete training data has many practical applications in image analysis and retrieval. This paper proposes a...
Linjiang Yu, Georgy L. Gimel'farb
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 6 months ago
Multi-directional Width-Bounded Geometric Separator and Protein Folding
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu
STOC
2002
ACM
101views Algorithms» more  STOC 2002»
16 years 24 days ago
An exponential separation between regular and general resolution
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
Michael Alekhnovich, Jan Johannsen, Toniann Pitass...
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
15 years 19 days ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
Grégoire Lecerf