Sciweavers

62 search results - page 10 / 13
» Computation of Locally Free Class Groups
Sort
View
WG
2010
Springer
13 years 6 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
14 years 9 months ago
Parallel Evaluation of Composite Aggregate Queries
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
Lei Chen 0003, Christopher Olston, Raghu Ramakrish...
SADM
2010
196views more  SADM 2010»
13 years 2 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 10 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
CHI
2005
ACM
14 years 8 months ago
Six themes of the communicative appropriation of photographic images
In this paper, we explore the use of digital photographs in computer-mediated communication. We present Lascaux, an instant messaging client that serves as a research platform for...
Amy Voida, Elizabeth D. Mynatt