Sciweavers

1244 search results - page 154 / 249
» Searching in Higher Dimension
Sort
View
IPM
2006
252views more  IPM 2006»
15 years 6 months ago
Automatic ranking of information retrieval systems using data fusion
Measuring effectiveness of information retrieval (IR) systems is essential for research and development and for monitoring search quality in dynamic environments. In this study, w...
Rabia Nuray, Fazli Can
PRESENCE
2000
89views more  PRESENCE 2000»
15 years 6 months ago
Using Presence Questionnaires in Reality
A between-group experiment was carried out to assess whether two different presence questionnaires can distinguish between real and virtual experiences. One group of 10 subjects s...
Martin Usoh, Ernest Catena, Sima Arman, Mel Slater
WWW
2008
ACM
16 years 7 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
COMPGEOM
2010
ACM
15 years 11 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 11 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis