Sciweavers

284 search results - page 55 / 57
» What Matchings Can Be Stable
Sort
View
SIGCOMM
2004
ACM
14 years 24 days ago
Building a better NetFlow
Network operators need to determine the composition of the traffic mix on links when looking for dominant applications, users, or estimating traffic matrices. Cisco’s NetFlow ha...
Cristian Estan, Ken Keys, David Moore, George Varg...
ICALP
2010
Springer
14 years 4 days ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
CIKM
2009
Springer
14 years 3 hour ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009
ICPIA
1992
13 years 11 months ago
Intelligent Pattern Recognition and Applications
:: This talk deals with fundamental aspects of Intelligent Pattern Recognition (IPR) and applications. It basically includes the following: Overview of 3D Biometric Technology and ...
Patrick Shen-Pei Wang
CIVR
2006
Springer
13 years 11 months ago
Query by Semantic Example
A combination of query-by-visual-example (QBVE) and semantic retrieval (SR), denoted as query-by-semantic-example (QBSE), is proposed. Images are labeled with respect to a vocabula...
Nikhil Rasiwasia, Nuno Vasconcelos, Pedro J. Moren...