Sciweavers

20294 search results - page 3796 / 4059
» Algorithmic Information Theory
Sort
View
PEWASUN
2004
ACM
16 years 2 days ago
A novel solution for achieving anonymity in wireless ad hoc networks
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...
Azzedine Boukerche, Khalil El-Khatib, Li Xu, Larry...
UIST
2004
ACM
16 years 2 days ago
Hierarchical parsing and recognition of hand-sketched diagrams
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
Levent Burak Kara, Thomas F. Stahovich
CIKM
2004
Springer
16 years 1 days ago
Distributional term representations: an experimental comparison
A number of content management tasks, including term categorization, term clustering, and automated thesaurus generation, view natural language terms (e.g. words, noun phrases) as...
Alberto Lavelli, Fabrizio Sebastiani, Roberto Zano...
CIKM
2004
Springer
16 years 1 days ago
Event threading within news topics
With the overwhelming volume of online news available today, there is an increasing need for automatic techniques to analyze and present news to the user in a meaningful and effi...
Ramesh Nallapati, Ao Feng, Fuchun Peng, James Alla...
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
16 years 1 days ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
« Prev « First page 3796 / 4059 Last » Next »