Sciweavers

2184 search results - page 393 / 437
» Relative Entropy and Statistics
Sort
View
ICFCA
2007
Springer
16 years 25 days 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
16 years 24 days 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,...
TSD
2007
Springer
16 years 23 days 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
WEBI
2007
Springer
16 years 23 days 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
AUIC
2006
IEEE
16 years 22 days 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ä