Sciweavers

1435 search results - page 102 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
121
Voted
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
15 years 9 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
115
Voted
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 3 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
126
Voted
ATAL
2010
Springer
15 years 3 months ago
Learning multirobot joint action plans from simultaneous task execution demonstrations
The central problem of designing intelligent robot systems which learn by demonstrations of desired behaviour has been largely studied within the field of robotics. Numerous archi...
Murilo Fernandes Martins, Yiannis Demiris
127
Voted
SIGIR
2008
ACM
15 years 2 months ago
A bayesian logistic regression model for active relevance feedback
Relevance feedback, which traditionally uses the terms in the relevant documents to enrich the user's initial query, is an effective method for improving retrieval performanc...
Zuobing Xu, Ram Akella
122
Voted
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
15 years 22 days ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh