Sciweavers

444 search results - page 76 / 89
» More Colourful Simplices
Sort
View
ACG
2006
Springer
14 years 2 months ago
A New Family of k-in-a-Row Games
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
I-Chen Wu, Dei-Yen Huang
INTERSENSE
2006
ACM
14 years 2 months ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
DASFAA
2005
IEEE
141views Database» more  DASFAA 2005»
14 years 2 months ago
Learning Tree Augmented Naive Bayes for Ranking
Naive Bayes has been widely used in data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, numerous algorit...
Liangxiao Jiang, Harry Zhang, Zhihua Cai, Jiang Su
SIGIR
2005
ACM
14 years 2 months ago
A database centric view of semantic image annotation and retrieval
We introduce a new model for semantic annotation and retrieval from image databases. The new model is based on a probabilistic formulation that poses annotation and retrieval as c...
Gustavo Carneiro, Nuno Vasconcelos
GD
2005
Springer
14 years 2 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...