Sciweavers

2766 search results - page 298 / 554
» Algorithms for trigonometric polynomials
Sort
View
FOCS
2008
IEEE
15 years 11 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
165
Voted
MOBICOM
2003
ACM
15 years 10 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 5 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 6 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
124
Voted
PODS
2004
ACM
86views Database» more  PODS 2004»
16 years 5 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven