Sciweavers

8377 search results - page 1390 / 1676
» Scenarios - Introduction
Sort
View
INFOCOM
2011
IEEE
14 years 10 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
184
Voted
IWC
2011
212views more  IWC 2011»
14 years 9 months ago
Automatic web accessibility metrics: Where we are and where we can go
 The  fact  that  several  web  accessibility  metrics  exist  may  be  evidence  of  a  lack  of  a  comparison  framework   that  highlights  how  well  th...
Markel Vigo, Giorgio Brajnik
JSS
2011
106views more  JSS 2011»
14 years 9 months ago
A family of implementation-friendly BN elliptic curves
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
C. C. F. Pereira Geovandro, Marcos A. Simplí...
PAMI
2011
14 years 9 months ago
Silhouette Segmentation in Multiple Views
— In this paper, we present a method for extracting consistent foreground regions when multiple views of a scene are available. We propose a framework that automatically identiï¬...
Wonwoo Lee, Woontack Woo, Edmond Boyer
SDM
2011
SIAM
243views Data Mining» more  SDM 2011»
14 years 9 months ago
Data Integration via Constrained Clustering: An Application to Enzyme Clustering
When multiple data sources are available for clustering, an a priori data integration process is usually required. This process may be costly and may not lead to good clusterings,...
Elisa Boari de Lima, Raquel Cardoso de Melo Minard...
« Prev « First page 1390 / 1676 Last » Next »