Sciweavers

608 search results - page 42 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
SIGIR
2011
ACM
12 years 11 months ago
Learning online discussion structures by conditional random fields
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
Hongning Wang, Chi Wang, ChengXiang Zhai, Jiawei H...
WPES
2003
ACM
14 years 2 months ago
Hidden Credentials
Hidden Credentials are useful in situations where requests for service, credentials, access policies and resources are extremely sensitive. We show how transactions which depend o...
Jason E. Holt, Robert W. Bradshaw, Kent E. Seamons...
ICRA
1999
IEEE
106views Robotics» more  ICRA 1999»
14 years 1 months ago
Haptic Exploration of Fine Surface Features
In this paper we consider the detection of small surface features, such as ridges and bumps, on the surface of an object during dextrous manipulation. First we review the represen...
Allison M. Okamura, Mark R. Cutkosky
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 9 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
ARITH
2007
IEEE
14 years 3 months ago
Optimistic Parallelization of Floating-Point Accumulation
Abstract— Floating-point arithmetic is notoriously nonassociative due to the limited precision representation which demands intermediate values be rounded to fit in the availabl...
Nachiket Kapre, André DeHon