Sciweavers

16188 search results - page 2711 / 3238
» The Optimal PAC Algorithm
Sort
View
EGH
2011
Springer
14 years 6 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
EMNLP
2011
14 years 6 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
16 years 1 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
IACR
2011
136views more  IACR 2011»
14 years 6 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
INFOCOM
2012
IEEE
13 years 9 months ago
Uplink soft frequency reuse for self-coexistence of cognitive radio networks operating in white-space spectrum
—Recent advances in cognitive radio (CR) technology have brought about a number of wireless standards that support opportunistic access to available white-space spectrum. Address...
Bo Gao, Jung-Min Park 0001, Yaling Yang
« Prev « First page 2711 / 3238 Last » Next »