Sciweavers

522 search results - page 16 / 105
» On the Hardness of the Noncommutative Determinant
Sort
View
PAMI
2012
11 years 10 months ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
RTSS
2009
IEEE
14 years 2 months ago
Rapid Early-Phase Virtual Integration
In complex hard real-time systems with tight constraints on system resources, small changes in one component of a system can cause a cascade of adverse effects on other parts of t...
Sibin Mohan, Min-Young Nam, Rodolfo Pellizzoni, Lu...
HYBRID
2004
Springer
14 years 1 months ago
Event-Driven Programming with Logical Execution Times
We present a new high-level programming language, called XGIOTTO, for programming applications with hard real-time constraints. Like its predecessor, XGIOTTO is based on the LET (l...
Arkadeb Ghosal, Thomas A. Henzinger, Christoph M. ...
BMCBI
2011
13 years 2 months ago
A discriminative method for family-based protein remote homology detection that combines inductive logic programming and proposi
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
Juliana S. Bernardes, Alessandra Carbone, Gerson Z...
CORR
2002
Springer
125views Education» more  CORR 2002»
13 years 7 months ago
Complexity of Manipulating Elections with Few Candidates
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
Vincent Conitzer, Tuomas Sandholm