Sciweavers

5158 search results - page 827 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
WWW
2004
ACM
16 years 7 months ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...
WWW
2002
ACM
16 years 7 months ago
Clustering for opportunistic communication
We describe ongoing work on I2I, a system aimed at fostering opportunistic communication among users viewing or manipulating content on the Web and in productivity applications. U...
Jay Budzik, Shannon Bradshaw, Xiaobin Fu, Kristian...
ICFP
2009
ACM
16 years 7 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 7 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
183
Voted
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
16 years 7 months ago
Constrained optimization for validation-guided conditional random field learning
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
Minmin Chen, Yixin Chen, Michael R. Brent, Aaron E...