Sciweavers

1382 search results - page 153 / 277
» Formal Analysis of Online Algorithms
Sort
View
JDWM
2007
112views more  JDWM 2007»
15 years 6 months ago
Empowering the OLAP Technology to Support Complex Dimension Hierarchies
Comprehensive data analysis has become indispensable in a variety of domains. OLAP (On-Line Analytical Processing) systems tend to perform poorly or even fail when applied to comp...
Svetlana Mansmann, Marc H. Scholl
DEXAW
2007
IEEE
137views Database» more  DEXAW 2007»
16 years 23 days ago
FCA for contextual semantic navigation and information retrieval in heterogeneous information systems
This paper presents an information retrieval methodology which uses Formal Concept Analysis in conjunction with semantics to provide contextual answers to users’ queries. User f...
Géraldine Polaillon, Marie-Aude Aufaure, B&...
COLT
2006
Springer
15 years 10 months ago
A Sober Look at Clustering Stability
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...
Shai Ben-David, Ulrike von Luxburg, Dávid P...
CSREAESA
2004
15 years 7 months ago
Identifying and Evaluating a Generic Set of Superinstructions for Embedded Java Programs
In this paper we present an approach to the optimisation of interpreted Java programs using superinstructions. Unlike existing techniques, we examine the feasibility of identifying...
Diarmuid O'Donoghue, James F. Power
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
15 years 12 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee