Sciweavers

1322 search results - page 223 / 265
» Parameterized counting problems
Sort
View
INFFUS
2006
103views more  INFFUS 2006»
13 years 10 months ago
Information fusion approaches to the automatic pronunciation of print by analogy
Automatic pronunciation of words from their spelling alone is a hard computational problem, especially for languages like English and French where there is only a partially consis...
Robert I. Damper, Yannick Marchand
JCP
2008
142views more  JCP 2008»
13 years 10 months ago
QoS Aware Query Processing Algorithm for Wireless Sensor Networks
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
Jun-Zhao Sun
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 10 months ago
Interpolation in Valiant's theory
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
Pascal Koiran, Sylvain Perifel
JUCS
2008
134views more  JUCS 2008»
13 years 10 months ago
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...
Irène Durand, Sylviane R. Schwer
SIGMETRICS
2008
ACM
13 years 10 months ago
A Diophantine model of routes in structured P2P overlays
Abstract-- An important intrinsic property of any structured Peer-to-Peer (P2P) overlay is multi-hop paths. Understanding their structure helps to solve challenging problems relate...
Dmitry Korzun, Andrei Gurtov