Sciweavers

4934 search results - page 61 / 987
» complexity 2008
Sort
View
DAM
2002
82views more  DAM 2002»
15 years 3 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
132
Voted
TJS
2002
101views more  TJS 2002»
15 years 3 months ago
Compilation for Adaptive Computing Systems Using Complex Parameterized Hardware Objects
FLAME, the Flexible API for Module-based Environments, is a proposed standard interface for the integration of parameterized hardware generators into high-level design tools. This ...
Andreas Koch
110
Voted
IJBC
2008
88views more  IJBC 2008»
15 years 3 months ago
Characterizing the Structural Quality of General Complex Software Networks
nodes and their interactions are abstract edges. This paper attempts to characterize the structural quality of complex software networks. We propose to use a novel statistical meas...
Jing Liu, Jinhu Lu, Keqing He, Bing Li, Chi Kong T...
133
Voted
NIPS
2008
15 years 5 months ago
Rademacher Complexity Bounds for Non-I.I.D. Processes
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
Mehryar Mohri, Afshin Rostamizadeh
92
Voted
COLING
1990
15 years 5 months ago
A Type-theoretical Analysis of Complex Verb Generation
Tense and aspect, together with mood and modality, usually form the entangled structure of a complex verb. They are often hard to translate by machines, because of both syntactic ...
Satoshi Tojo