2080 search results - page 128 / 416 » Measuring empirical computational complexity |
174
click to vote
DSN
2005
IEEE
15 years 6 months ago
2005
IEEE
The behavior of large-scale wireless sensor networks has been shown to be surprisingly complex and difficult to analyze, both by empirical experiment and simulation. In this pape...
150
click to vote
TCS
2010
14 years 11 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
122
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
Structured models often achieve excellent performance but can be slow at test time. We investigate structure compilation, where we replace structure with features, which are often...
153
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Description Logics (DLs) are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from si...
132
click to vote
CGI
2004
IEEE
15 years 8 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...