Sciweavers

935 search results - page 68 / 187
» Some Results on Orthogonal Factorizations
Sort
View
CN
2007
110views more  CN 2007»
14 years 10 months ago
Stability of FIFO networks under adversarial models: State of the art
Network stability is an important issue that has attracted the attention of many researchers in recent years. Such interest comes from the need to ensure that, as the system runs ...
Vicent Cholvi, Juan Echagüe
SIAMDM
2002
52views more  SIAMDM 2002»
14 years 9 months ago
Testing k-colorability
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
Noga Alon, Michael Krivelevich
IR
2010
14 years 8 months ago
Gradient descent optimization of smoothed information retrieval metrics
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
Olivier Chapelle, Mingrui Wu
ENTCS
2007
115views more  ENTCS 2007»
14 years 10 months ago
Self Management and the Future of Software Design
Most software is fragile: even the slightest error, such as changing a single bit, can make it crash. As software complexity has increased, development techniques have kept pace t...
Peter Van Roy
DSN
2005
IEEE
15 years 3 months ago
Coverage and the Use of Cyclic Redundancy Codes in Ultra-Dependable Systems
A Cyclic Redundancy Code (CRC), when used properly, can be an effective and relatively inexpensive method to detect data corruption across communication channels. However, some sy...
Michael Paulitsch, Jennifer Morris, Brendan Hall, ...