Sciweavers

4908 search results - page 118 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
16 years 1 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
SIAMNUM
2011
139views more  SIAMNUM 2011»
15 years 1 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
AAAI
2006
15 years 7 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 12 months ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez
SPAA
2010
ACM
15 years 6 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis