Sciweavers

1059 search results - page 203 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 8 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 8 months ago
Learning methods for lung tumor markerless gating in image-guided radiotherapy
In an idealized gated radiotherapy treatment, radiation is delivered only when the tumor is at the right position. For gated lung cancer radiotherapy, it is difficult to generate ...
Ying Cui, Jennifer G. Dy, Gregory C. Sharp, Brian ...
CIKM
2003
Springer
14 years 24 days ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 8 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...