Sciweavers

350 search results - page 21 / 70
» Hardness Results for Homology Localization
Sort
View
COMPGEOM
2004
ACM
14 years 25 days ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
ANLP
2000
81views more  ANLP 2000»
13 years 8 months ago
Experimenting with the Interaction between Aggregation and Text Structuring
In natural language generation, different generation tasks often interact with each other in a complex way, which is hard to capture in the pipeline architecture described by Reit...
Hua Cheng
MOBIHOC
2012
ACM
11 years 9 months ago
EV-Loc: integrating electronic and visual signals for accurate localization
Nowadays, an increasing number of objects can be represented by their wireless electronic identifiers. For example, people can be recognized by their phone numbers or their phone...
Boying Zhang, Jin Teng, Junda Zhu, Xinfeng Li, Don...
SENSYS
2009
ACM
14 years 2 months ago
Achieving range-free localization beyond connectivity
Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods f...
Ziguo Zhong, Tian He
SIGIR
2005
ACM
14 years 29 days ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He