Sciweavers

1012 search results - page 126 / 203
» Segment intersection searching problems in general settings
Sort
View
STACS
2010
Springer
15 years 6 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
AI
1998
Springer
15 years 4 months ago
A Hybrid Convergent Method for Learning Probabilistic Networks
During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
Jun Liu, Kuo-Chu Chang, Jing Zhou
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 8 days ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
ESANN
2007
15 years 1 months ago
A novel kernel-based method for local pattern extraction in random process signals
In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub similarities at rando...
Majid Beigi, Andreas Zell
CIKM
2008
Springer
15 years 29 days ago
Cost-effective spam detection in p2p file-sharing systems
Spam is highly pervasive in P2P file-sharing systems and is difficult to detect automatically before actually downloading a file due to the insufficient and biased description of ...
Dongmei Jia