Sciweavers

12742 search results - page 62 / 2549
» On canonical number systems
Sort
View
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
15 years 1 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
FC
2010
Springer
141views Cryptology» more  FC 2010»
15 years 1 months ago
When Information Improves Information Security
We investigate a mixed economy of an individual rational expert and several na¨ıve near-sighted agents in the context of security decision making. Agents select between three ca...
Jens Grossklags, Benjamin Johnson, Nicolas Christi...
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 6 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
ISLPED
2004
ACM
123views Hardware» more  ISLPED 2004»
15 years 3 months ago
An efficient voltage scaling algorithm for complex SoCs with few number of voltage modes
Increasing demand for larger high-performance applications requires developing more complex systems with hundreds of processing cores on a single chip. To allow dynamic voltage sc...
Bita Gorjiara, Nader Bagherzadeh, Pai H. Chou
KR
2000
Springer
15 years 1 months ago
Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...
Volker Haarslev, Ralf Möller