Sciweavers

501 search results - page 86 / 101
» Rough Sets
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
PODC
2004
ACM
14 years 1 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
SIGCSE
2004
ACM
140views Education» more  SIGCSE 2004»
14 years 1 months ago
CFX: finding just the right examples for CS1
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
Dale Reed, Sam John, Ryan Aviles, Feihong Hsu
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
SIGGRAPH
1996
ACM
13 years 11 months ago
Flow and Changes in Appearance
An important, largely unexplored area of computer image generation is the simulation of weathering and its effects on appearance. Weathering results from the interaction of the en...
Julie Dorsey, Hans Køhling Pedersen, Pat Ha...