Results 1  10
of
13,743
A Theory of Diagnosis from First Principles
 ARTIFICIAL INTELLIGENCE
, 1987
"... Suppose one is given a description of a system, together with an observation of the system's behaviour which conflicts with the way the system is meant to behave. The diagnostic problem is to determine those components of the system which, when assumed to be functioning abnormally, will explain ..."
Abstract

Cited by 1120 (5 self)
 Add to MetaCart
competing diagnoses. Finally, the theory reveals close connections between diagnostic reasoning and nonmonotonic reasoning.
Contentbased image retrieval at the end of the early years
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2000
"... The paper presents a review of 200 references in contentbased image retrieval. The paper starts with discussing the working conditions of contentbased retrieval: patterns of use, types of pictures, the role of semantics, and the sensory gap. Subsequent sections discuss computational steps for imag ..."
Abstract

Cited by 1618 (24 self)
 Add to MetaCart
. Similarity of pictures and objects in pictures is reviewed for each of the feature types, in close connection to the types and means of feedback the user of the systems is capable of giving by interaction. We briefly discuss aspects of system engineering: databases, system architecture, and evaluation
THE HYPERSPACE OF CLOSED CONNECTED SUBSETS OF A EUCLIDEAN SPACE
"... Abstract. Let R n denote ndimensional Euclidean space and C(R n) denote the hyperspace of closed connected subsets of R n, with the Vietoris topology. The following results are obtained: (1) C(R 1) is homeomorphic to R 1 × [0, 1] and hence is locally compact; (2) If n ≥ 2 and A ∈ C(R n), then C(R n ..."
Abstract
 Add to MetaCart
Abstract. Let R n denote ndimensional Euclidean space and C(R n) denote the hyperspace of closed connected subsets of R n, with the Vietoris topology. The following results are obtained: (1) C(R 1) is homeomorphic to R 1 × [0, 1] and hence is locally compact; (2) If n ≥ 2 and A ∈ C(R n), then C
Minimum energy mobile wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract

Cited by 749 (0 self)
 Add to MetaCart
node guarantees strong connectivity of the entire network and attains the global minimum energy solution for stationary networks. Due to its localized nature, this protocol proves to be selfreconfiguring and stays close to the minimum energy solution when applied to mobile networks. Simulation results
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2825 (11 self)
 Add to MetaCart
simple notion of monotone reducibility and exhibit complete problems. This provides a framework for stating existing results and asking new questions. We show that mNL (monotone nondeterministic logspace) is not closed under complementation, in contrast to Immerman's and Szelepcs &apos
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract

Cited by 2010 (5 self)
 Add to MetaCart
The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when
DeNoising By SoftThresholding
, 1992
"... Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0 by an a ..."
Abstract

Cited by 1279 (14 self)
 Add to MetaCart
by an amount p 2 log(n) = p n. We prove two results about that estimator. [Smooth]: With high probability ^ fn is at least as smooth as f, in any of a wide variety of smoothness measures. [Adapt]: The estimator comes nearly as close in mean square to f as any measurable estimator can come, uniformly over
Myrinet: A GigabitperSecond Local Area Network
 IEEE Micro
, 1995
"... Abstract. Myrinet is a new type of localarea network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP messagepassing network that can span campus dimensions, rather than as a widea ..."
Abstract

Cited by 1011 (0 self)
 Add to MetaCart
area telecommunications network that is operating in close quarters. The technical steps toward making Myrinet a reality included the development of (1) robust, 25m communication channels with flow control, packet framing, and error control; (2) selfinitializing, lowlatency, cutthrough switches; (3) host interfaces
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract

Cited by 493 (0 self)
 Add to MetaCart
A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem
The Performance of TCP/IP for Networks with High BandwidthDelay Products and Random Loss.
 IEEE/ACM Trans. Networking,
, 1997
"... AbstractThis paper examines the performance of TCP/IP, the Internet data transport protocol, over widearea networks (WANs) in which data traffic could coexist with realtime traffic such as voice and video. Specifically, we attempt to develop a basic understanding, using analysis and simulation, ..."
Abstract

Cited by 465 (6 self)
 Add to MetaCart
, of the properties of TCP/IP in a regime where: 1) the bandwidthdelay product of the network is high compared to the buffering in the network and 2) packets may incur random loss (e.g., due to transient congestion caused by fluctuations in realtime traffic, or wireless links in the path of the connection
Results 1  10
of
13,743