Sciweavers

1066 search results - page 99 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
RECOMB
2006
Springer
15 years 10 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
ECCV
2004
Springer
15 years 11 months ago
Transformation-Invariant Embedding for Image Analysis
Abstract. Dimensionality reduction is an essential aspect of visual processing. Traditionally, linear dimensionality reduction techniques such as principle components analysis have...
Ali Ghodsi, Jiayuan Huang, Dale Schuurmans
CGF
2008
201views more  CGF 2008»
14 years 10 months ago
High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
Darko Pavic, Leif Kobbelt
ATAL
2003
Springer
15 years 3 months ago
A decision making procedure for collaborative planning
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
Timothy W. Rauenbusch, Barbara J. Grosz
TSP
2010
14 years 4 months ago
A nondata-aided SNR estimation technique for multilevel modulations exploiting signal cyclostationarity
Signal-to-noise ratio (SNR) estimators of linear modulation schemes usually operate at one sample per symbol at the matched filter output. In this paper we propose a new method for...
Jaume Riba, Javier Villares, Gregori Vázque...