Sciweavers

4131 search results - page 28 / 827
» Compactness in Topology and Computation
Sort
View
ICCV
2011
IEEE
14 years 1 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
COMPGEOM
2011
ACM
14 years 5 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
FOCS
2002
IEEE
15 years 6 months ago
Optimal System of Loops on an Orientable Surface
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
Éric Colin de Verdière, Francis Laza...
132
Voted
ISMB
1996
15 years 3 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal
ICDCSW
2011
IEEE
14 years 1 months ago
Link-Level Network Topology Generation
Abstract—Internet topology generation involves producing synthetic network topologies that imitate the characteristics of the Internet. Although the accuracy of newly developed n...
Mehmet Burak Akgun, Mehmet Hadi Gunes