Sciweavers

6045 search results - page 331 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
WG
2007
Springer
16 years 1 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
CCECE
2006
IEEE
16 years 1 months ago
Adaptive Multi-Stream Relaying
— In this paper, we study a cooperative network with one source-destination pair and a relay assisting their communication. All terminals have multiple antennas, which enables th...
Furuzan Atay Onat, Halim Yanikomeroglu, Shalini S....
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
16 years 1 months ago
Fast Implementation of Lemke's Algorithm for Rigid Body Contact Simulation
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
John E. Lloyd
RTSS
2005
IEEE
16 years 1 months ago
Quantifying the Gap between Embedded Control Models and Time-Triggered Implementations
Mapping a set of feedback control components to executable code introduces errors due to a variety of factors such as discretization, computational delays, and scheduling policies...
Hakan Yazarel, Antoine Girard, George J. Pappas, R...
183
Voted
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
16 years 29 days ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran