Sciweavers

33 search results - page 5 / 7
» Labeled Partitions and the q-Derangement Numbers
Sort
View
ICPR
2008
IEEE
15 years 6 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
ICPADS
2006
IEEE
15 years 5 months ago
Coloring the Internet: IP Traceback
Several IP Traceback schemes employing packet marking have been proposed to trace DoS/DDoS attacks that use source address spoofing. The major challenges in the design of an ef...
Muthusrinivasan Muthuprasanna, G. Manimaran, Manso...
CVPR
2010
IEEE
15 years 7 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
15 years 5 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
SIGIR
2003
ACM
15 years 5 months ago
Image classification using hybrid neural networks
Use of semantic content is one of the major issues which needs to be addressed for improving image retrieval effectiveness. We present a new approach to classify images based on t...
Chih-Fong Tsai, Kenneth McGarry, John Tait