Results 1  10
of
356,940
RealTime Dynamic Voltage Scaling for LowPower Embedded Operating Systems
, 2001
"... In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery lif ..."
Abstract

Cited by 498 (4 self)
 Add to MetaCart
the necessary peak computation power in generalpurpose systems. However, for a large class of applications in embedded realtime systems like cellular phones and camcorders, the variable operating frequency interferes with their deadline guarantee mechanisms, and DVS in this context, despite its growing
House Prices, Borrowing Constraints, and Monetary Policy in the Business Cycle
, 2002
"... I develop a general equilibrium model with sticky prices, credit constraints, nominal loans and asset prices. Changes in asset prices modify agents ’ borrowing capacity through collateral value; changes in nominal prices affect real repayments through debt deflation. Monetary policy shocks move asse ..."
Abstract

Cited by 496 (10 self)
 Add to MetaCart
I develop a general equilibrium model with sticky prices, credit constraints, nominal loans and asset prices. Changes in asset prices modify agents ’ borrowing capacity through collateral value; changes in nominal prices affect real repayments through debt deflation. Monetary policy shocks move asset and nominal prices in the same direction, and are amplified and propagated over time. The “financial accelerator ” is not constant across shocks: nominal debt stabilises supply shocks, making the economy less volatile when the central bank controls the interest rate. I discuss the role of equity, debt indexation and household and firm leverage in the propagation mechanism. Finally, I find that monetary policy should not target asset prices as a means of reducing output and inflation volatility.
A Separator Theorem for Planar Graphs
, 1977
"... Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which ..."
Abstract

Cited by 465 (1 self)
 Add to MetaCart
Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which finds such a partition A, B, C in O(n) time.
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
to the separation of the geometrical and topological aspects of the problem and to the use of two simple but powerful primitives, a geometric predicate and an operator for manipulating the topology of the diagram. The topology is represented by a new data structure for generalized diagrams, that is, embeddings
Formalising trust as a computational concept
, 1994
"... Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? T ..."
Abstract

Cited by 518 (5 self)
 Add to MetaCart
? This thesis provides a clarification of trust. We present a formalism for trust which provides us with a tool for precise discussion. The formalism is implementable: it can be embedded in an artificial agent, enabling the agent to make trustbased decisions. Its applicability in the domain of Distributed
Wrapper Induction for Information Extraction
, 1997
"... The Internet presents numerous sources of useful informationtelephone directories, product catalogs, stock quotes, weather forecasts, etc. Recently, many systems have been built that automatically gather and manipulate such information on a user's behalf. However, these resources are usually ..."
Abstract

Cited by 612 (30 self)
 Add to MetaCart
are usually formatted for use by people (e.g., the relevant content is embedded in HTML pages), so extracting their content is difficult. Wrappers are often used for this purpose. A wrapper is a procedure for extracting a particular resource's content. Unfortunately, handcoding wrappers is tedious. We
Algorithms for Scalable Synchronization on SharedMemory Multiprocessors
 ACM Transactions on Computer Systems
, 1991
"... Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract

Cited by 567 (32 self)
 Add to MetaCart
markedly more pronounced as applications scale. We argue that this problem is not fundamental, and that one can in fact construct busywait synchronization algorithms that induce no memory or interconnect contention. The key to these algorithms is for every processor to spin on separate locally
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 612 (12 self)
 Add to MetaCart
to accomplish this, we propose to appropriately generalize the wellknown notion of a separation margin and derive a corresponding maximummargin formulation. While this leads to a quadratic program with a potentially prohibitive, i.e. exponential, number of constraints, we present a cutting plane algorithm
Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks
 IEEE/ACM Transactions on Networking
, 2004
"... This paper proposes SMAC, a medium access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use batteryoperated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract

Cited by 684 (15 self)
 Add to MetaCart
.11 in several ways: energy conservation and selfconfiguration are primary goals, while pernode fairness and latency are less important. SMAC uses a few novel techniques to reduce energy consumption and support selfconfiguration. It enables lowdutycycle operation in a multihop network. Nodes form virtual
Results 1  10
of
356,940