Sciweavers

4940 search results - page 380 / 988
» On the Complexity of Universal Programs
Sort
View
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
15 years 8 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
ISICT
2003
15 years 8 months ago
Towards a natural interface to adaptive service composition
As computers become ubiquitous in our every day lives, providing a means for true user empowerment will become crucial. Techniques which allow dynamic reuse and composition of exi...
Steffen Higel, Tony O'Donnell, Vincent Wade
NIPS
2003
15 years 8 months ago
Link Prediction in Relational Data
Many real-world domains are relational in nature, consisting of a set of objects related to each other in complex ways. This paper focuses on predicting the existence and the type...
Benjamin Taskar, Ming Fai Wong, Pieter Abbeel, Dap...
AIPS
1994
15 years 8 months ago
Planning for Dynamic Configuration of Component-based Architectures
The Scenario-based Engineering Process (SEP)is a novel approachto developingcomplexsystems.SEPbuilds newapplication systemsthrougha selectionprocessthat groupsprimitive components...
Gail Haddock
CLEF
2010
Springer
15 years 7 months ago
UNT at ImageCLEF 2010: CLIR for Wikipedia Images
This paper presents the results of the team of the University of North Texas in the Wikipedia image retrieval track of Image-CLEF-2010. Our approach is based on performing translat...
Miguel E. Ruiz, Jiangping Chen, Karthikeyan Pasupa...