Sciweavers

3360 search results - page 444 / 672
» Opportunistic Data Structures with Applications
Sort
View
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
145
Voted
EDBT
2000
ACM
15 years 8 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...
LWA
2007
15 years 6 months ago
Know the Right People? Recommender Systems for Web 2.0
Web 2.0 applications like Flickr, YouTube, or Del.icio.us are increasingly popular online communities for creating, editing and sharing content. However, the rapid increase in siz...
Stefan Siersdorfer, Sergej Sizov, Paul Clough
PUC
2002
82views more  PUC 2002»
15 years 4 months ago
A Location Model for Communicating and Processing of Context
Location is one of the most important elements of context in ubiquitous computing. In this paper we describe a location model, a spatial-aware communication model and an implement...
Michael Beigl, Tobias Zimmer, Christian Decker
MVA
2007
158views Computer Vision» more  MVA 2007»
15 years 4 months ago
Hybrid object labelling in digital images
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
Julio Martín-Herrero