Sciweavers

301 search results - page 52 / 61
» On Finding Dense Subgraphs
Sort
View
JMLR
2010
111views more  JMLR 2010»
14 years 4 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
PAMI
2010
124views more  PAMI 2010»
14 years 4 months ago
Structural Approach for Building Reconstruction from a Single DSM
We present a new approach for building reconstruction from a single Digital Surface Model (DSM). It treats buildings as an assemblage of simple urban structures extracted from a li...
Florent Lafarge, Xavier Descombes, Josiane Zerubia...
TDSC
2010
157views more  TDSC 2010»
14 years 4 months ago
On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
Fei Xing, Wenye Wang
CVPR
2008
IEEE
15 years 11 months ago
Margin-based discriminant dimensionality reduction for visual recognition
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
Hakan Cevikalp, Bill Triggs, Frédéri...
GIS
2008
ACM
15 years 10 months ago
Density based co-location pattern discovery
Co-location pattern discovery is to find classes of spatial objects that are frequently located together. For example, if two categories of businesses often locate together, they ...
Xiangye Xiao, Xing Xie, Qiong Luo, Wei-Ying Ma