Results 1 - 10
of
18,408
Construction of Escherichia coli K-12 in-frame, single-gene knockout mutants: the Keio collection. Mol. Syst. Biol 2:2006.0008
, 2006
"... We have systematically made a set of precisely defined, single-gene deletions of all nonessential genes in Escherichia coli K-12. Open-reading frame coding regions were replaced with a kanamycin cassette flanked by FLP recognition target sites by using a one-step method for inactivation of chromosom ..."
Abstract
-
Cited by 714 (7 self)
- Add to MetaCart
We have systematically made a set of precisely defined, single-gene deletions of all nonessential genes in Escherichia coli K-12. Open-reading frame coding regions were replaced with a kanamycin cassette flanked by FLP recognition target sites by using a one-step method for inactivation
Visual categorization with bags of keypoints
- In Workshop on Statistical Learning in Computer Vision, ECCV
, 2004
"... Abstract. We present a novel method for generic visual categorization: the problem of identifying the object content of natural images while generalizing across variations inherent to the object class. This bag of keypoints method is based on vector quantization of affine invariant descriptors of im ..."
Abstract
-
Cited by 1005 (14 self)
- Add to MetaCart
Abstract. We present a novel method for generic visual categorization: the problem of identifying the object content of natural images while generalizing across variations inherent to the object class. This bag of keypoints method is based on vector quantization of affine invariant descriptors
A large mass hierarchy from a small extra dimension
, 1999
"... We propose a new higher-dimensional mechanism for solving the hierarchy problem. The weak scale is generated from a large scale of order the Planck scale through an exponential hierarchy. However, this exponential arises not from gauge interactions but from the background metric (which is a slice of ..."
Abstract
-
Cited by 1077 (3 self)
- Add to MetaCart
We propose a new higher-dimensional mechanism for solving the hierarchy problem. The weak scale is generated from a large scale of order the Planck scale through an exponential hierarchy. However, this exponential arises not from gauge interactions but from the background metric (which is a slice
Myrinet: A Gigabit-per-Second Local Area Network
- IEEE Micro
, 1995
"... Abstract. Myrinet is a new type of local-area network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP message-passing network that can span campus dimensions, rather than as a wide-a ..."
Abstract
-
Cited by 1011 (0 self)
- Add to MetaCart
Abstract. Myrinet is a new type of local-area network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP message-passing network that can span campus dimensions, rather than as a wide
An Overview of Evolutionary Algorithms in Multiobjective Optimization
- Evolutionary Computation
, 1995
"... The application of evolutionary algorithms (EAs) in multiobjective optimization is currently receiving growing interest from researchers with various backgrounds. Most research in this area has understandably concentrated on the selection stage of EAs, due to the need to integrate vectorial performa ..."
Abstract
-
Cited by 492 (13 self)
- Add to MetaCart
The application of evolutionary algorithms (EAs) in multiobjective optimization is currently receiving growing interest from researchers with various backgrounds. Most research in this area has understandably concentrated on the selection stage of EAs, due to the need to integrate vectorial
The Computational Brain.
, 1994
"... Keywords: reductionism, neural networks, distributed coding, Karl Pribram, computational neuroscience, receptive field 1.1 The broad goal of this book, expressed at the start, is ``to understand how neurons give rise to a mental life.'' A mental reductionism is assumed in this seductively ..."
Abstract
-
Cited by 450 (7 self)
- Add to MetaCart
of single-cell recording methods. The problem is that millions of neurons participate in every behaviorally meaningful activity, but we normally record from only one neuron at a time, or at best a handful. The temptation is great to overestimate the one-millionth sample obtained from a single neuron
Linear multiuser detectors for synchronous code-division multiple-access channels
- IEEE TRANS. INFORM. THEORY
, 1989
"... In code-division multiple-access systems, simultaneous mul-tiuser accessing of a common channel is made possible by assigning a signature waveform to each user. Knowledge of these waveforms enables the receiver to demodulate the data streams of each user, upon observation of the sum of the transmitt ..."
Abstract
-
Cited by 385 (4 self)
- Add to MetaCart
of the transmitted signals, perturbed by additive noise. Under the assumptions of symbol-synchronous transmissions and white Gaussian noise, we analyze the detection mechanism at the receiver, comparing different detectors by their bit error rate in the low background noise region, and by their worst-case behavior
Face Detection In Color Images
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2002
"... Human face detection is often the first step in applications such as video surveillance, human computer interface, face recognition, and image database management. We propose a face detection algorithm for color images in the presence of varying lighting conditions as well as complex backgrounds. Ou ..."
Abstract
-
Cited by 338 (8 self)
- Add to MetaCart
. Our method detects skin regions over the entire image, and then generates face candidates based on the spatial arrangement of these skin patches. The algorithm constructs eye, mouth, and boundary maps for verifying each face candidate. Experimental results demonstrate successful detection over a wide
Patch-based Background Initialization in Heavily Cluttered Video
- SUBMITTED TO IEEE TRANSACTIONS ON IMAGE PROCESSING
, 2009
"... In this paper we propose a patch-based technique for robust background initialization that exploits both spatial and temporal consistency of the static background. The proposed technique is able to cope with heavy clutter, i.e, foreground objects that stand still for a considerable portion of time. ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
In this paper we propose a patch-based technique for robust background initialization that exploits both spatial and temporal consistency of the static background. The proposed technique is able to cope with heavy clutter, i.e, foreground objects that stand still for a considerable portion of time
Vectorizing cartoon animations
- IEEE Transactions on Visualization and Computer Graphics, IEEE computer Society Digital Library
, 2009
"... Abstract—We present a system for vectorizing 2D raster format cartoon animations. The output animations are visually flicker free, smaller in file size, and easy to edit. We identify decorative lines separately from colored regions. We use an accurate and semantically meaningful image decomposition ..."
Abstract
-
Cited by 18 (4 self)
- Add to MetaCart
) the separate handling of decorative lines as special objects during image decomposition, avoiding results containing multiple short, thin oversegmented regions, and 3) extraction of a single patch-based background for all frames, which provides a basis for consistent, flicker-free animations. Index Terms
Results 1 - 10
of
18,408