Sciweavers

76 search results - page 12 / 16
» Testing Polynomials over General Fields
Sort
View
CHI
2004
ACM
14 years 7 months ago
Story lifecycle in a product development organization
This poster describes an integrated set of stories and story-based activities that we have used in product development in IBM Software Group's Lotus product organizations. We...
Majie Zeller, Sandra L. Kogan, Michael J. Muller, ...
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
14 years 8 months ago
List decoding tensor products and interleaved codes
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...
ICIP
1999
IEEE
14 years 9 months ago
Hyperparameter Estimation for Emission Computed Tomography Data
Over the last years many statistical models have been proposed to restore tomographical images. However, their use in medical environment has been limited due to several factors. ...
Aggelos K. Katsaggelos, Antonio López, Rafa...
LICS
2002
IEEE
14 years 11 days ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin