Sciweavers

699 search results - page 81 / 140
» The method of combinatorial telescoping
Sort
View
PAMI
2006
440views more  PAMI 2006»
15 years 3 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
COMBINATORICS
2004
76views more  COMBINATORICS 2004»
15 years 3 months ago
Geometrically Constructed Bases for Homology of Partition Lattices
Abstract. We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "sp...
Anders Björner, Michelle L. Wachs
119
Voted
CORR
1998
Springer
105views Education» more  CORR 1998»
15 years 3 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
114
Voted
RSA
2002
71views more  RSA 2002»
15 years 3 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
TISSEC
2002
123views more  TISSEC 2002»
15 years 3 months ago
An algebraic approach to IP traceback
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
Drew Dean, Matthew K. Franklin, Adam Stubblefield