3466 search results - page 130 / 694 » Fast computation of special resultants |
92
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
107
click to vote
PERCOM
2006
ACM
16 years 17 days ago
2006
ACM
There are a variety of approaches to improve the speed at which large RFID tag populations are being identified. In this paper, we present a transmission control strategy for a co...
102
click to vote
ICML
2009
IEEE
15 years 7 months ago
2009
IEEE
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
111
click to vote
ICMCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
101
click to vote
ICMCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The paper focuses on reconstructing the discontinuity between homogenous color regions in an interpolated image to improve its perceptual quality. A low-resolution input image is ...