Sciweavers

756 search results - page 136 / 152
» Recent progress with BOXES
Sort
View
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
13 years 10 months ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
13 years 10 months ago
Small Spans in Scaled Dimension
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
John M. Hitchcock
CIKM
2006
Springer
13 years 10 months ago
TRIPS and TIDES: new algorithms for tree mining
Recent research in data mining has progressed from mining frequent itemsets to more general and structured patterns like trees and graphs. In this paper, we address the problem of...
Shirish Tatikonda, Srinivasan Parthasarathy, Tahsi...
EUROSSC
2006
Springer
13 years 10 months ago
Towards Hovering Information
This paper introduces a new concept of information that can exist in a mobile environment with no fixed infrastructure and centralized servers, which we call the Hovering Informati...
Alfredo A. Villalba Castro, Dimitri Konstantas
ATAL
2008
Springer
13 years 8 months ago
An adaptive probabilistic trust model and its evaluation
In open settings, the participants are autonomous and there is no central authority to ensure the felicity of their interactions. When agents interact in such settings, each relie...
Chung-Wei Hang, Yonghong Wang, Munindar P. Singh