Sciweavers

10539 search results - page 26 / 2108
» On L
Sort
View
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 1 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
APCSAC
2003
IEEE
14 years 26 days ago
L1 Cache and TLB Enhancements to the RAMpage Memory Hierarchy
The RAMpage hierarchy moves main memory up a level to replace the lowest-level cache by an equivalent-sized SRAM main memory, with a TLB caching page translations for that main mem...
Philip Machanick, Zunaid Patel
ICSE
2001
IEEE-ACM
14 years 5 hour ago
David L. Parnas Symposium
David L. Parnas is one of the grandmasters of software engineering. His academic research and industrial collaborations have exerted far-reaching influence on software design and ...
Daniel Hoffman, David M. Weiss
ECTEL
2006
Springer
13 years 11 months ago
The L2C Project: Learning to Collaborate Through Advanced SmallWorld Simulations
Abstract. L2C - Learning to Collaborate - is an ongoing research project addressing the design of effective immersive simulation-based learning experiences supporting the developme...
Albert A. Angehrn, Thierry Nabeth
FSTTCS
2006
Springer
13 years 11 months ago
One-Input-Face MPCVP Is Hard for L, But in LogDCFL
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circui...
Tanmoy Chakraborty, Samir Datta