Sciweavers

4940 search results - page 909 / 988
» On the Complexity of Universal Programs
Sort
View
JMLR
2008
168views more  JMLR 2008»
13 years 10 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
DAM
2007
107views more  DAM 2007»
13 years 10 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
JSAC
2008
111views more  JSAC 2008»
13 years 10 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
ENTCS
2007
116views more  ENTCS 2007»
13 years 10 months ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
RE
2006
Springer
13 years 9 months ago
Interaction Analysis in Aspect-Oriented Models
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...
Katharina Mehner, Mattia Monga, Gabriele Taentzer