Sciweavers

2184 search results - page 393 / 437
» Relative Entropy and Statistics
Sort
View
ICFCA
2007
Springer
15 years 6 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
IPSN
2007
Springer
15 years 6 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
123
Voted
TSD
2007
Springer
15 years 6 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an
102
Voted
WEBI
2007
Springer
15 years 6 months ago
Concordance-Based Entity-Oriented Search
— We consider the problem of finding the relevant named entities in response to a search query over a given text corpus. Entity search can readily be used to augment conventiona...
Mikhail Bautin, Steven Skiena
108
Voted
AUIC
2006
IEEE
15 years 6 months ago
Implementing a natural user interface for camera phones using visual tags
Pointing is a natural way of communicating. Children in all cultures use pointing inherently. Attaching tags to our environment enables interaction by pointing. Visual tags are a g...
Sanni Siltanen, Jouko Hyväkkä